The Euclidean travelling salesman problem is NP-complete
نویسندگان
چکیده
منابع مشابه
Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem
In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM. The efficiency of the HPRM is compared as against some existing mutation operators; namely,...
متن کاملOptimierung Und Kontrolle Projektbereich Diskrete Optimierung Three Easy Special Cases of the Euclidean Travelling Salesman Problem Three Easy Special Cases of the Euclidean Travelling Salesman Problem
It is known that in case the distance matrix in the Travelling Salesman Problem (TSP) fulllls certain combinatorial conditions (e.g. the Demidenko conditions , the Kalmanson conditions or the Supnick conditions) then the TSP is solvable in polynomial time. This paper deals with the problem of recognizing Euclidean instances of the TSP for which there is a renumbering of the cities such that the...
متن کاملEuclidean Traveling Salesman Problem
Since the computation of an exact solution is very expensive (under the assumption that P 6= NP ), we are interested in approximate solutions – at least for special cases. Particularly, we look for an Polynomial Time Approximation Scheme (PTAS), i.e., for any fixed error parameter ε > 0, the running time is bounded by a polynomial in n and the costs of the computed tour does not exceed (1+ε) ·O...
متن کاملThe Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P
This paper presents the differences between two NP problems. It focuses in the Euclidian 2 Dimension Travelling Salesman Problems and General Assign Problems. The main results are the triangle reduction to verify the solution in polynomial time for the former and for the later the solution to the Noted Conjecture of the NP-Class, NP is not P.
متن کاملThe Maze Generation Problem is NP-complete
The Maze Generation problem has been presented as a benchmark for the Second Answer Set Programming Competition. We prove that the problem is NP–complete and identify relevant classes of unsatisfiable instances. The Maze Generation (MG) problem has been presented as a benchmark for the Second Answer Set Programming (ASP) Competition1. The problem has been placed in the NP category, which contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1977
ISSN: 0304-3975
DOI: 10.1016/0304-3975(77)90012-3